Abstract This paper presents an algorithm for a non-standard logicminimization problem that arises in -valued propositional logic. The problem is motivated by the potential for obtaining better answers in applications that use -valued logic. An answer of or provides precise (definite) information; an answer of provides imprecise (indefinite) information. By replacing a formula with a “better” f...

We present a general two-step algorithm which transforms a graph expressing the semantic dependencies between the words of an utterance into logic formulae representing the different semantic interpretations of the utterance. The algorithm focuses on the scopal elements of the utterance, i.e. quantifiers and scopal predicates. First, the scope of every scopal element is computed as a subgraph o...

This paper describes a way of expressing syntactic rules that ~kssociate semantic formulae with strings, but in a manner thai is independent of the syntactic details of these formulac. In particular we show how the same rules construct predicate argument formulae in the style of Montague grammar[131, rap_ resentations reminiscent of situation semantics(Barwise and Perry 121) and of the event lo...

The pragmalinguistic and sociopragmatic aspects of language use vary across different situations, languages, and cultures. The separation of these two facets of language use can help to map out the socio-cultural norms and conventions as well as the linguistic forms and strategies that underlie the pragmatic performance of different language speakers in a variety of target language use situatio...

Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...

On the semantics of determiners in a rich type-theoretical framework The variation of word meaning according to the context led us to enrich the type system of our syntactical and semantic analyser of French based on categorial grammars and Montague semantics (or lambda-DRT). The main advantage of a deep semantic analyse is too represent meaning by logical formulae that can be easily used e.g. ...

the pragmalinguistic and sociopragmatic aspects of language use vary across different situations, languages, and cultures. the separation of these two facets of language use can help to map out the socio-cultural norms and conventions as well as the linguistic forms and strategies that underlie the pragmatic performance of different language speakers in a variety of target language use situatio...

Surface realisation from flat semantic formulae is known to be exponential in the length of the input. In this paper, we argue that TAG naturally supports the integration of three main ways of reducing complexity: polarity filtering, delayed adjunction and empty semantic items elimination. We support these claims by presenting some preliminary results of the TAG-based surface realiser GenI.